Multiplication optimization technique for Elliptic Curve based sensor network security

Sensor Network Security: Elliptic Curve Cryptography on SunSPOTs

Security is critical for wireless sensor networks. While several security mechanisms and protocols have been developed in the context of the Internet, many new challenges arise due to the characteristics of power-constrained wireless sensor networks. In this work, we focus on the Javaprogrammable SunSPOT device and elliptic curve cryptography (ECC). We present an analysis of run times and energ...

Elliptic Curve Cryptography based Techniques for Information and Network Security

Elliptic Curve Point Multiplication

New type of elliptic curve point multiplication is proposed, where complex multiplication by 2 − or by 2 ) 7 1 ( − ± is used instead of point duplication. This allows speeding up multiplication about 1.34 times. Using higher radix makes it possible to use one point duplication instead of two and to speed-up computation about 1.6 times. The method takes prime group order factorization: ρ ρ = r a...

Fast GPGPU-Based Elliptic Curve Scalar Multiplication

This paper presents a fast implementation to compute the scalar multiplication of elliptic curve points based on a General-Purpose computing on Graphics Processing Units (GPGPU) approach. A GPU implementation using Dan Bernstein's Curve25519, an elliptic curve over a 255-bit prime eld complying with the new 128-bit security level, computes the scalar multiplication in less than a microsecond on...

Implementing Network Security Protocols based on Elliptic Curve Cryptography

Elliptic curve cryptography provides a methodology for obtaining high-speed, efficient, and scalable implementations of network security protocols. In this paper, we describe in detail three protocols based on elliptic curve cryptographic techniques, and the results of our implementation of the elliptic curve cryptography over the Galois field GF (2k), where k is a composite number. 1 Elliptic ...